On reconstructing arrangements from their sets of simplices
نویسندگان
چکیده
Let GH(S; H) be the bipartite graph with partition sets S and H , the set of simplices and hyperplanes of H, where simplex s∈ S is adjacent to hyperplane h∈H if one facet of s lies on h. In this paper, we give a complete characterization of GH(S; H) when H is a -arrangement. We also study GH(S; H) when H is a pseudoline arrangement. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Directed Subgraph Complexes
Let G be a directed graph, and let ∆ACY G be the simplicial complex whose simplices are the edge sets of acyclic subgraphs of G. Similarly, we define ∆NSC G to be the simplicial complex with the edge sets of not strongly connected subgraphs of G as simplices. We show that ∆ACY G is homotopy equivalent to the (n−1−k)-dimensional sphere if G is a disjoint union of k strongly connected graphs. Oth...
متن کاملArrangements of equal minors in the positive Grassmannian
We discuss arrangements of equal minors in totally positive matrices. More precisely, we would like to investigate the structure of possible equalities and inequalities between the minors. We show that arrangements of equals minors of largest value are in bijection with sorted sets, which earlier appeared in the context of alcoved polytopes and Gröbner bases. Maximal arrangements of this form c...
متن کاملStreamline tracing on irregular geometries
The accurate and efficient tracing of streamlines is fundamental to any streamline-based simulation method. For grids with irregular cell geometries, such as corner-point grids with faults or Voronoidiagram (pebi) grids, most efforts to trace streamlines have been focused on subdividing irregular cells into sets of simpler subcells, typically hexahedra or simplices. Then one proceeds by reconst...
متن کاملHypernetworks for reconstructing the dynamics of multilevel systems
Networks are fundamental for reconstructing the dynamics of many systems, but have the drawback that they are restricted to binary relations. Hypergraphs extend relational structure to multi-vertex edges, but are essentially set-theoretic and unable to represent essential structural properties. Hypernetworks are a natural multidimensional generalisation of networks, representing n-ary relations...
متن کاملArrangements and Amounts of Equal Minors in Totally Positive Matrices
Understanding the positive Grassmannian has been a highly significant question in mathematics for several decades. We discuss arrangements of equal minors in the totally positive Grassmannian. It was previously shown that arrangements of equals minors of largest value correspond to the simplices in Sturmfels triangulation. Here we discuss arrangements of equals minors of second largest value, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 226 شماره
صفحات -
تاریخ انتشار 2001